Unbounded-2-bounded: a two-phase approximation for model checking unbounded until properties of probabilistic systems
نویسندگان
چکیده
Jennings, Paul, "Unbounded-2-bounded: a two-phase approximation for model checking unbounded until properties of probabilistic systems" (2011). Graduate Theses and Dissertations. Paper 12134.
منابع مشابه
Approximate Model Checking of PCTL Involving Unbounded Path Properties
We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate methods have been proposed primarily to deal with state-space explosion that makes the exact model checking by numerical methods practically infeasible for large systems. However, the existing statistical methods either consid...
متن کاملBounded versus Unbounded Model Checking for Interpreted Systems⋆
This paper addresses the problem of verification of multiagent systems by means of symbolic model checking. It is shown how to adapt the techniques of bounded and unbounded model checking to verify temporal epistemic properties of multi-agent systems. We give details of these two techniques for the logic that extends CTLK by past modalities, and show how it can be applied to the well known trai...
متن کاملModel-Checking Algorithms for Continuous-Time Markov Chains
Continuous-time Markov chains (CTMCs) have been widely used to determine system performance and dependability characteristics. Their analysis most often concerns the computation of steady-state and transient-state probabilities. This paper introduces a branching temporal logic for expressing real-time probabilistic properties on CTMCs and presents approximate model checking algorithms for this ...
متن کاملEfficient Algorithms for Time- and Cost-Bounded Probabilistic Model Checking
In the design of probabilistic timed systems, bounded requirements concerning behaviour that occurs within a given time, energy, or more generally cost budget are of central importance. Traditionally, such requirements have been model-checked via a reduction to the unbounded case by unfolding the model according to the cost bound. This exacerbates the state space explosion problem and significa...
متن کاملTackling Truncation Errors in CSL Model Checking through Bounding Semantics
Model checking aims to give exact answers to queries about a model’s execution but, in probabilistic model checking, ensuring exact answers might be difficult. Numerical iterative methods are heavily used in probabilistic model checking and errors caused by truncation may affect correctness. To tackle truncation errors, we investigate the bounding semantics of continuous stochastic logic for Ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015